A van Benthem Theorem for Fuzzy Modal Logic

نویسندگان

  • Paul Wild
  • Lutz Schröder
  • Dirk Pattinson
  • Barbara König
چکیده

We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes propositional modal logic as the bisimulation-invariant fragment of first-order logic. Specifically, we consider a first-order fuzzy predicate logic alongwith its modal fragment, and show that the fuzzy first-order formulas that are non-expansive w.r.t. the natural notion of bisimulation distance are exactly those that can be approximated by fuzzy modal formulas. CCS Concepts •Theory of computation→Modal and temporal logics; Description logics;

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Van Benthem Theorem for Modal Team Semantics

The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework of modal dependence logic MDL and team semantics. We show that modal team logic MTL, extending MDL by classical negation, captures exactly the FO-definable bisimulation in...

متن کامل

A Van Benthem/Rosen theorem for coalgebraic predicate logic

Coalgebraic modal logic serves as a unifying framework to study a wide range of modal logics beyond the relational realm, including probabilistic and graded logics as well as conditional logics and logics based on neighbourhoods and games. Coalgebraic predicate logic (CPL), a generalization of a neighbourhoodbased first-order logic introduced by Chang, has been identified as a natural first-ord...

متن کامل

Sahlqvist Correspondence for Modal mu-calculus

We define analogues of modal Sahlqvist formulas for the modal mucalculus, and prove a correspondence theorem for them.

متن کامل

for modal mu - calculus

We define analogues of modal Sahlqvist formulas for the modal mu-calculus, and prove a correspondence theorem for them.

متن کامل

A New Modal Lindström Theorem

We prove new Lindström theorems for the basic modal propositional language, and for the guarded fragment of first-order logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference between abstract model theory for fragments and for extensions of first-order logic. 1 What is modal logic? I would broadly endorse the 'minimal desi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1802.00478  شماره 

صفحات  -

تاریخ انتشار 2018